Approximate Max k-Cut with subgraph guarantee
نویسندگان
چکیده
منابع مشابه
Approximate Max k-Cut with Subgraph Guarantee
We study the following variant of the Max k Cut problem Given an input graph G with positively weighted edges and k colors the number k being xed and not dependent on the input instance we wish to compute a subgraph H of G containing lots of heavy edges and a color assignment c V k such that a all edges in H are properly colored and b a large fraction of edges in G nH is properly colored We giv...
متن کاملApproximate Max Cut
where S(n) is the n dimensional unit sphere in IR. This is an instance of semi-definite programming, which is a special case of convex programming, which can be solved in polynomial time (solved here means approximated within arbitrary constant in polynomial time). Observe that (P) is a relaxation of (Q), and as such the optimal solution of (P) has value larger than the optimal value of (Q). Th...
متن کاملChapter 23 Approximate Max Cut
Given an undirected graph G = (V, E) and nonnegative weights ω i j on the edge i j ∈ E, the maximum cut problem (MAX CUT) is that of finding the set of vertices S that maximizes the weight of the edges in the cut (S , S); that is, the weight of the edges with one endpoint in S and the other in S. For simplicity, we usually set ω i j = O for i j E and denote the weight of a cut (S , S) by w(S , ...
متن کاملMax k-cut and judicious k-partitions
Alon, Bollobás, Krivelevich and Sudakov [1] proved that every graph with a large cut has a bipartition in which each vertex class contains correspondingly few edges. We prove an analogous result for partitions into k ≥ 3 classes; along the way we prove a result for biased bipartitions.
متن کاملThe Capacitated max-k-cut Problem
We consider a capacitated max k-cut problem in which a set of vertices is partitioned into k subsets. Each edge has a non-negative weight, and each subset has a possibly different capacity that imposes an upper bound on its size. The objective is to find a partition that maximizes the sum of edge weights across all pairs of vertices that lie in different subsets. We describe a local-search algo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Processing Letters
سال: 1998
ISSN: 0020-0190
DOI: 10.1016/s0020-0190(98)00005-2